GPU Volume Raycasting using Bounding Interval Hierarchies
نویسنده
چکیده
Traditional Direct Volume Raycasting (DVR) on the GPU is limited to uniform voxel grids stored as 3D textures. This approach is not optimal for sparse data sets or data sets with highly varying frequencies because it requires a trade-off between data structure size and the maximum reproducible frequency and it lacks implicit empty space skipping during raycasting. In this paper we present another approach, applying the Bounding Interval Hierarchy (BIH), a hierarchical spatial subdivision of elements traditionally used to accelerate surface raytracing, to volume raycasting on the GPU. Although connectivity information between voxels is lost and the texture filtering power of GPUs cannot be exploited, we show that it may be a viable alternative for DVR and that the approach is generic, allowing all sorts of renderable voxels (not-overlapping finite volume elements/primitives such as cuboids, ellipsoids and truncated Radial Basis Functions) for different tasks like rendering point sets as particle systems (e.g. using spherical voxels) and rendering volumes derived from traditional uniform grids (with implicit empty space skipping and the option for different levels of detail).
منابع مشابه
Review and Comparative Study of Ray Traversal Algorithms on a Modern GPU Architecture
In this paper we present a chronological review of five distinct data structures commonly found in literature and ray tracing systems: Bounding Volume Hierarchies (BVH), Octrees, Uniform Grids, KD-Trees, and Bounding Interval Hierarchies (BIH). This review is then followed by an extensive comparative study of six different ray traversal algorithms implemented on a modern Kepler CUDA GPU archite...
متن کاملGPU-accelerated Hausdorff distance computation between dynamic deformable NURBS surfaces
We present a parallel GPU-accelerated algorithm for computing the directed Hausdorff distance from one NURBS surface to another, within a bound. We make use of axis-aligned bounding-box hierarchies that bound the NURBS surfaces to accelerate the computations. We dynamically construct as well as traverse the bounding-box hierarchies for the NURBS surfaces using operations that are optimized for ...
متن کاملFast BVH Construction on GPUs
We present two novel parallel algorithms for rapidly constructing bounding volume hierarchies on manycore GPUs. The first uses a linear ordering derived from spatial Morton codes to build hierarchies extremely quickly and with high parallel scalability. The second is a top-down approach that uses the surface area heuristic (SAH) to build hierarchies optimized for fast ray tracing. Both algorith...
متن کاملgProximity: Hierarchical GPU-based Operations for Collision and Distance Queries
We present novel parallel algorithms for collision detection and separation distance computation for rigid and deformable models that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data parallelism to perform fast hierarchy construction, updating, and traversal using tight-fitting bounding volumes such as oriented bounding boxes (OBB) and rectangular swep...
متن کاملGPU Collision Detection in Conformal Geometric Space
We derive a conformal algebra treatment unifying all types of collisions among points, vectors, areas (defined by bivectors and trivectors) and 3D solid objects (defined by trivectors and quadvectors), based in a reformulation of collision queries from R3 to conformal R4,1 space. The algebraic formulation in this 5D space is then implemented in GPU to allow faster parallel computation queries. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009